Envy-free division of discrete cakes
نویسندگان
چکیده
منابع مشابه
On Envy-Free Cake Division
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Mathematical Association of America is collaborating with ...
متن کاملEnvy-Free Division of Sellable Goods
We study the envy-free allocation of indivisible goods between two players. Our novel setting includes an option to sell each good for a fraction of the minimum value any player has for the good. To rigorously quantify the efficiency gain from selling, we reason about the price of envy-freeness of allocations of sellable goods — the ratio between the maximum social welfare and the social welfar...
متن کاملN-person Envy-free Chore Division
In this paper we consider the problem of chore division, which is closely related to a classical question, due to Steinhaus [7], of how to cut a cake fairly. We focus on constructive solutions, i.e., those obtained via a well-defined procedure or algorithm. Among the many notions of fairness is envy-freeness: an envy-free cake division is a set of cuts and an allocation of the pieces that gives...
متن کاملExact Procedures for Envy-free Chore Division
We develop the rst explicit procedures for exact envy-free chore division for 4 or more players. We also give a simple 3-person procedure. Our 4-person moving-knife scheme and n-person discrete algorithm are accomplished by exploiting a notion of \irrevocable advantage" for chores, and are motivated by similar solutions for cake-cutting by Brams, Taylor, and Zwicker. We discuss the diierences b...
متن کاملTwo-player envy-free multi-cake division
We introduce a generalized cake-cutting problem in which we seek to divide multiple cakes so that two players may get their most-preferred piece selections: a choice of one piece from each cake, allowing for the possibility of linked preferences over the cakes. For two players, we show that disjoint envy-free piece selections may not exist for two cakes cut into two pieces each, and they may no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.06.032